Characterizing logic grammars: A substructural logic approach
نویسندگان
چکیده
منابع مشابه
A Useful Substructural Logic
Formal systems seem to come in two general kinds: useful and useless. This is painting things starkly, but the point is important. Formal structures can either be used in interesting and important ways, or they can languish unused and irrelevant. Lewis' modal logics are good examples. The systems S4 and S5 are useful in many diierent ways. They map out structures that are relevant to a number o...
متن کاملA Substructural Epistemic Resource Logic
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...
متن کاملChapter 3 Substructural logic
Linear logic is the most famous of the substructural logics. Traditional intuitionistic logic, which we call persistent to emphasize the treatment of truth as a persistent and reusable resource, admits the three so-called structural rules of weakening (premises need not be used), contraction (premises may be used multiple times) and exchange (the ordering of premises are irrelevant). Substructu...
متن کاملSubstructural Fuzzy-Relevance Logic
This paper proposes a new topic in substructural logic for use in research joining the fields of relevance and fuzzy logics. For this, we consider old and new relevance principles. We first introduce fuzzy systems satisfying an old relevance principle, i.e., Dunn’s weak relevance principle. We present ways to obtain relevant companions of the weakening-free uninorm (based) systems introduced by...
متن کاملConstructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff’s substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has been shown by Spinks and Veroff in [9], [10] that the variety of Nelson algebras, the algebras of constructive logic with strong negation N, is term-equivalent to a certain variety of bounded commutative residuated lattices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1996
ISSN: 0743-1066
DOI: 10.1016/0743-1066(95)00075-5